Order-Sorted Rewriting and Congruence Closure
نویسنده
چکیده
Order-sorted type systems supporting inheritance hierarchies and subtype polymorphism are used in theorem proving, AI, and declarative programming. The satisfiability problems for the theories of: (i) order-sorted uninterpreted function symbols, and (ii) of such symbols modulo a subset Δ of associative-commutative ones are reduced to the unsorted versions of such problems at no extra computational cost. New results on order-sorted rewriting are needed to achieve this reduction.
منابع مشابه
Smaran: A Congruence-Closure Based System for Equational Computations
p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...
متن کاملDeciding Confluence of Certain Term Rewriting Systems in Polynomial Time
We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a ...
متن کاملShostak's Congruence Closure as Completion
Shostak's congruence closure algorithm is demystiied, using the framework of ground completion on (possibly nonterminating, non-reduced) rewrite rules. In particular, the canonical rewriting relation induced by the algorithm on ground terms by a given set of ground equations is precisely constructed. The main idea is to extend the signature of the original input to include new constant symbols ...
متن کاملBrick polytopes, lattice quotients, and Hopf algebras
This paper is motivated by the interplay between the Tamari lattice, J.-L. Loday’s realization of the associahedron, and J.-L. Loday and M. Ronco’s Hopf algebra on binary trees. We show that these constructions extend in the world of acyclic k-triangulations, which were already considered as the vertices of V. Pilaud and F. Santos’ brick polytopes. We describe combinatorially a natural surjecti...
متن کاملStructural Rewriting in the π-Calculus
We consider reduction in the synchronous π-calculus with replication, without sums. Usual definitions of reduction in the π-calculus use a closure w.r.t. structural congruence of processes. In this paper we operationalize structural congruence by providing a reduction relation for piprocesses which also performs necessary structural conversions explicitly by rewrite rules. As we show, a subset ...
متن کامل